On the Maintenance of Low Cost Multicast Trees with Bandwidth Reservation

نویسندگان

  • Dirceu Cavendish
  • Aiguo Fei
  • Mario Gerla
  • Raphael Rom
چکیده

Emerging multimedia network technologies are bringing new challenges to protocols design, due to new QoS requirements. These requirements, when combined with traditional network functions, such as routing, render the design of such protocols more complex than ever before. Resource reservation is one of the novel features brought into the picture by multimedia applications. Another is the manyto-many nature of multicast connections. We have recently proposed a routing algorithm to build low cost multicast trees. In this paper, we study the maintenance of these multicast trees, in the face of multicast membership changes over time (join/leave). One of the key issues is the tradeo between the incremental upgrade at each join/leave request and the recomputation of the entire tree at each step. Simulation results are used to illustrate these trade o s. A signalling mechanism for the implementation of the incremental tree updating is also included. Technical Subject Areas: Broadband Switching Systems and ATM Networks, Multimedia and Broadband Services.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Construction of Low Cost Multicast Trees with Bandwidth Reservation

This report presents routing algorithms for many-to-many multicast connections with band-width requirements. The objective is to compute a connectivity structure among multicast members of low cost, taking into account their bandwidth requirements. We rst study the complexity of routing multicast connections with bandwidth reservation. Based on derived impossibility results , we propose a clust...

متن کامل

A Delay-Constrained Protocol for Shared Multicast Tree Construction

In this paper we present a multicast protocol for building and maintaining Delay-Constrained Multi-cast Shared Trees (DCMST). Our protocol is based on the search of available Delay-Constrained multi-path to graft a new receiver to the shared tree. The new receiver chooses the most promising route regarding to its available bandwidth. This improvesthe load balancing on the network and we ooer be...

متن کامل

On Finding Feasible Solutions to the Group Multicast Routing Problem

Group multicast routing problem (GMRP) is a generalization of multicasting whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. The traditional solutions only care for the low cos...

متن کامل

Resource Allocation in a Multicast Tree - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies

We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth resewed at the link by all receivers using that link We formulate and solve a problem of a...

متن کامل

Resource Allocation in a Multicast Tree

We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth reserved at the link by all receivers using that link. We formulate and solve a problem of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998